for _ in range(int(input())):
n, x = map(int, input().split())
if n%x: print(-1)
else:
v = [0]*(n+1)
v[1], v[x] = 1, 1
ans = [0] *(n+1)
ans[1]=x
ans[n] = 1
while x<n:
for mul in range(x*2, n+1, x):
if n%mul==0:
ans[x] = mul
x = mul
break
for i in range(1,len(ans)):
if ans[i]: print(ans[i], end=' ')
else: print(i, end=' ')
print()#include<bits/stdc++.h>
#define ll long long
#define pb push_back
using namespace std;
int n, x;
int main(){
int t;
cin >> t;
while (t--) {
cin >> n >> x;
vector<int> a(n + 1);
a[1] = x, a[n] = 1;
for (int i = 2; i < n; i++) {
a[i] = i;
}
if (x == n) {
for (int i = 1; i <= n; i++) cout << a[i] << " ";
cout << "\n";
continue;
}
vector<int> divisors;
int y = n;
int fl = 0;
if (y % x == 0) {
y = y / x;
}
else {
cout << "-1\n";
continue;
}
int lim = sqrt(y), ind = x;
for (int i = 2; i <= lim + 1; i++) {
while (y % i == 0) {
a[ind] = ind * i;
ind = ind * i;
y = y / i;
divisors.pb(i);
}
}
if (y > 1) a[ind] = ind * y;
for (int i = 1; i <= n; i++) cout << a[i] << " ";
cout << "\n";
}
}222. Count Complete Tree Nodes | 215. Kth Largest Element in an Array |
198. House Robber | 153. Find Minimum in Rotated Sorted Array |
150. Evaluate Reverse Polish Notation | 144. Binary Tree Preorder Traversal |
137. Single Number II | 130. Surrounded Regions |
129. Sum Root to Leaf Numbers | 120. Triangle |
102. Binary Tree Level Order Traversal | 96. Unique Binary Search Trees |
75. Sort Colors | 74. Search a 2D Matrix |
71. Simplify Path | 62. Unique Paths |
50. Pow(x, n) | 43. Multiply Strings |
34. Find First and Last Position of Element in Sorted Array | 33. Search in Rotated Sorted Array |
17. Letter Combinations of a Phone Number | 5. Longest Palindromic Substring |
3. Longest Substring Without Repeating Characters | 1312. Minimum Insertion Steps to Make a String Palindrome |
1092. Shortest Common Supersequence | 1044. Longest Duplicate Substring |
1032. Stream of Characters | 987. Vertical Order Traversal of a Binary Tree |
952. Largest Component Size by Common Factor | 212. Word Search II |